Modular arithmetic - PDFSEARCH.IO - Document Search Engine

Modular arithmetic
Results: 480

#	Item
51	Explicit Primality Criteria for h #2k ± 1 Wieb Bosma Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer. (Jul., 1993), ppStable URL: http://links.jstor.org/sici?sici= Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2008-03-28 07:26:11 Mathematics Discrete mathematics Number theory Modular arithmetic Integer sequences Finite fields Quadratic residue Prime number Quadratic reciprocity XTR Coprime integers Factorial
52	IMAPP MATHEMATICS RADBOUD UNIVERSITY NIJMEGEN The Netherlands Better paths for elliptic curve primality proofs Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2009-09-11 06:25:39 Mathematics Primality tests Number theory Abstract algebra Finite fields Analytic number theory Elliptic curve primality Group theory Modular arithmetic Elliptic curve Primality certificate AKS primality test
53	Density Computations for Real Quadratic Units Wieb Bosma; Peter Stevenhagen Mathematics of Computation, Vol. 65, NoJul., 1996), ppStable URL: http://links.jstor.org/sici?sici=%%2965% Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2008-03-28 07:24:09 Algebra Mathematics Abstract algebra Algebraic number theory Quadratic forms Field theory Modular arithmetic Quadratic field Prime number Discriminant Fundamental unit Factorization
54	Practice problems on modular arithmetic Math 1120b – March 9, Use the Euclidean algorithm to compute gcd(4589, 4849). Add to Reading List Source URL: gdenham.math.uwo.ca - Date: 2015-03-09 15:18:31
55	Quantum Computing and Cryptography Spring Semester 2011 Steve Vickers The University of Birmingham School of Computer Science Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2011-03-23 04:16:10 Electronic commerce Integer factorization algorithms RSA Prime number Modular arithmetic Coprime Euclidean algorithm Greatest common divisor Cryptography Mathematics Public-key cryptography
56	Offline Submission with RSA Time-Lock Puzzles Yves Igor Jerschow Martin Mauve Add to Reading List Source URL: wwwcn.cs.uni-duesseldorf.de Language: English - Date: 2014-01-09 02:12:40 Public-key cryptography Modular arithmetic Computer arithmetic Electronic commerce RSA Modular exponentiation Montgomery reduction Exponentiation by squaring Eternity II puzzle Cryptography Mathematics Abstract algebra
57	CSETFall 2009 HW6 Solution 1. Exercisepage 600) Add to Reading List Source URL: lechlak.com Language: English - Date: 2015-05-28 12:07:54 Algebraic number theory Quadratic residue Number theory Mathematics Modular arithmetic
58	VOLUME 9, NUMBER 1 NOVEMBER, 1961 GROUPS AS MACHINES Dear Sirs: Add to Reading List Source URL: lab.rockefeller.edu Language: English - Date: 2014-12-22 11:36:38 Modular arithmetic Fibonacci numbers Prime number Cyclic group Multiplicative order Group Abstract algebra Mathematics Algebra
59	Random Number Generators: Introduction for Operating System Developers Key material generation is as important to strong cryptosystems as the algorithms used. Weak random number generators (RNGs) have been known to creat Add to Reading List Source URL: www.nsa.gov Language: English - Date: 2014-07-17 09:45:36 Mathematics Applied mathematics Information theory Random number generation Entropy Modular arithmetic Key management Linear congruential generator Pseudo-ring Cryptography Pseudorandom number generators Randomness
60	CS 70 Fall 2003 Discrete Mathematics for CS Wagner Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:43 Computational number theory Modular arithmetic Multiplication Euclidean algorithm Greatest common divisor Multiplicative inverse Coprime Modulo operation Extended Euclidean algorithm Mathematics Integer factorization algorithms Number theory